Iterative Descent Method for Generalized Leontief Model
نویسندگان
چکیده
منابع مشابه
Application of iterative method for solving fuzzy Bernoulli equation under generalized H-differentiability
In this paper, the Picard method is proposed to solve the Bernoulli equation with fuzzy initial condition under generalized H-differentiability. The existence and uniqueness of the solution and convergence of the proposed method are proved in details. Finally an example shows the accuracy of this method.
متن کاملResidual norm steepest descent based iterative algorithms for Sylvester tensor equations
Consider the following consistent Sylvester tensor equation[mathscr{X}times_1 A +mathscr{X}times_2 B+mathscr{X}times_3 C=mathscr{D},]where the matrices $A,B, C$ and the tensor $mathscr{D}$ are given and $mathscr{X}$ is the unknown tensor. The current paper concerns with examining a simple and neat framework for accelerating the speed of convergence of the gradient-based iterative algorithm and ...
متن کاملGeneralized iterative methods for solving double saddle point problem
In this paper, we develop some stationary iterative schemes in block forms for solving double saddle point problem. To this end, we first generalize the Jacobi iterative method and study its convergence under certain condition. Moreover, using a relaxation parameter, the weighted version of the Jacobi method together with its convergence analysis are considered. Furthermore, we extend a method...
متن کاملAn E cient Iterative Method for the Generalized Stokes Problem
This paper presents an e cient iterative scheme for the generalized Stokes problem, which arises frequently in the simulation of time-dependent Navier-Stokes equations for incompressible uid ow. The general form of the linear system is A B B 0 ! u p ! = f 0 ! (1) where A = M + T is an n n symmetric positive de nite matrix, in which M is the mass matrix, T is the discrete Laplace operator, and a...
متن کاملA generalized method for iterative error mining in parsing results
Error mining is a useful technique for identifying forms that cause incomplete parses of sentences. We extend the iterative method of Sagot and de la Clergerie (2006) to treat n-grams of an arbitrary length. An inherent problem of incorporating longer n-grams is data sparseness. Our new method takes sparseness into account, producing n-grams that are as long as necessary to identify problematic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences, India Section A: Physical Sciences
سال: 2020
ISSN: 0369-8203,2250-1762
DOI: 10.1007/s40010-020-00714-9